Preprocessing and cutting planes with conflict graphs

This paper addresses the development of conflict graph-based algorithms and data structures into COIN-OR Branch-and-Cut (CBC) solver, including: (i) an efficient infrastructure for construction manipulation graphs; (ii) a preprocessing routine based on clique strengthening scheme that can both reduce number constraints produce stronger formulations; (iii) cut separator capable obtaining dual bounds at root node LP relaxation are 19.65% than those provided by equivalent generator state-of-the-art commercial 3.62 times better attained GLPK solver 4.22 obtained separation Cut Generation Library; (iv) odd-cycle with new lifting module to valid odd-wheel inequalities. The average gap closed this version CBC was up four its previous version. Moreover, mixed-integer programs solved in time limit three hours increased 23.53%.